A search game taking account of attributes of searching resources

This article deals with a two‐person zero‐sum game called a search allocation game (SAG), in which a searcher and a target participate as players. The searcher distributes his searching resources in a search space to detect the target. The effect of resources lasts a certain period of time and extends to some areas at a distance from the resources' dropped points. On the other hand, the target moves around in the search space to evade the searcher. In the history of search games, there has been little research covering the durability and reachability of searching resources. This article proposes two linear programming formulations to solve the SAG with durable and reachable resources, and at the same time provide an optimal strategy of distributing searching resources for the searcher and an optimal moving strategy for the target. Using examples, we will analyze the influences of two attributes of resources on optimal strategies. © 2007 Wiley Periodicals, Inc. Naval Research Logistics 2008     

提高“两课”教学的生动性三议

提高“两课”教学的生动性，就要在备课和讲课时，注重追求思想上的深刻、资料上的精彩和语言上的震撼与精美。力求思想深刻，内容精彩，语言精美。     

H 面双填充介质金属方波导的本征模

通过求解Ｈ面双填充介质金属方波导中位函数的亥姆霍兹方程,得到系统的电磁波的本征模函数及本征值方程,其本征模为ＬＳＥ模或ＬＳＭ模,并给出了色散关系的数值解。     

舰炮瞄准角速度和角加速度的定量分析

从舰炮火控原理出发,用坐标转换技术和微分理论,推导了在二轴和三轴稳定情况下,火炮瞄准的角速度和角加速度公式,并讨论了跟踪器的有关情况,给出了计算实例和主要结论。     

四支板超声速引射器性能特性试验

对二维喷管构型的四支板超声速引射器进行冷流试验,分析启动、负载匹配方面的性能特性。试验结果表明:启动特性方面,四支板超声速引射系统的盲腔压力低于3 kPa,引射器入口腔压的迟滞压力比启动压力低15.9%。负载匹配特性方面,四支板引射器在小引射系数、大增压比状态下具有十分明显的优势,当引射系数为0.04时,增压比为11.21;当引射系数为0.10时,增压比为7.0。因此,二维喷管构型的多支板超声速引射器具有良好的启动、负载匹配性能,工程应用潜力较大。     

激波诱导惰性堆积粉尘运动的建模及数值模拟

基于空间平均的双流体模型 ,引入描述颗粒脉动速度的粒化温度 ,建立颗粒相的本构方程 ,将粒化温度模型推广到解决高速流动问题。采用AUSM+ 有限差分法 ,数值模拟激波在一定厚度的惰性粉尘床中传播及诱导粉尘颗粒运动的过程。结果表明 ,粒化温度模型较好地描述了这一过程 ,证实了此模型在处理稠密颗粒高速流动和流场存在强间断中的可行性     

基于数据适应性检验的身管磨损量预测研究

应用灰色系统理论研究不确定系统,对系统进行灰色预测模型建立的同时,需要检验系统原始数据序列是否符合建模要求。主要从3个方面检验数据建模的可行性,分别是光滑比、极比偏差和凹凸性检验。结合某型坦克炮身管内膛烧蚀磨损数据,采用不同的磨损数据作为灰色预测模型建模的原始数据序列,具体分成两种情况进行数据检验,并代入模型计算,分析不同情况下模型的预测精度,通过对比计算结果选出与模型匹配度更高的原始数据序列。     

Single machine just‐in‐time scheduling problems with two competing agents

In scheduling problems with two competing agents, each one of the agents has his own set of jobs to be processed and his own objective function, and both share a common processor. In the single‐machine problem studied in this article, the goal is to find a joint schedule that minimizes the total deviation of the job completion times of the first agent from a common due‐date, subject to an upper bound on the maximum deviation of job completion times of the second agent. The problem is shown to be NP‐hard even for a nonrestrictive due‐date, and a pseudopolynomial dynamic program is introduced and tested numerically. For the case of a restrictive due‐date (a sufficiently small due‐date that may restrict the number of early jobs), a faster pseudopolynomial dynamic program is presented. We also study the multiagent case, which is proved to be strongly NP‐hard. A simple heuristic for this case is introduced, which is tested numerically against a lower bound, obtained by extending the dynamic programming algorithm. © 2013 Wiley Periodicals, Inc. Naval Research Logistics 61: 1–16, 2014     

A search game on a cyclic graph

There is a finite cyclic graph. The hider chooses one of all nodes except the specified one, and he hides an (immobile) object there. At the beginning the seeker is at the specified node. After the seeker chooses an ordering of the nodes except the specified one, he examines each nodes in that order until he finds the object, traveling along edges. It costs an amount when he moves from a node to an adjacent one and also when he checks a node. While the hider wishes to maximize the sum of the traveling costs and the examination costs which are required to find the object, the seeker wishes to minimize it. The problem is modeled as a two‐person zero‐sum game. We solve the game when unit costs (traveling cost + examination cost) have geometrical relations depending on nodes. Then we give properties of optimal strategies of both players. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004.     

基于激励机制的装备采办风险总量控制

针对装备采办中的风险总量控制,提出一种激励方式来提高承包商的积极性。在单目标风险控制模型的基础上,建立了多目标风险控制模型,推导出了激励机制下风险控制的最优合同公式。对激励机制中存在的两类错误进行了理论分析和实例验证,得出了两类错误对收益的影响,并在成本控制中得到了应用,有效地提高了装备采办的质量和效率,为军方决策者在装备采办中提供了合理的参考依据。